Revisit to the tail asymptotics of the double QBD process: Refinement and complete solutions for the coordinate and diagonal directions

نویسندگان

  • Masahiro Kobayashi
  • Masakiyo Miyazawa
چکیده

We consider a two dimensional skip-free reflecting random walk on a nonnegative integer quadrant. We are interested in the tail asymptotics of its stationary distribution, provided its existence is assumed. We derive exact tail asymptotics for the stationary probabilities on the coordinate axis. This refines the asymptotic results in the literature, and completely solves the tail asymptotic problem on the stationary marginal distributions in the coordinate and diagonal directions. For this, we use the so-called analytic function method in such a way that either generating functions or moment generating functions are suitably chosen. The results are exemplified by a two node network with simultaneous arrivals.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tail Decay Rates in Double QBD Processes and Related Reflected Random Walks

A double quasi-birth-and-death (QBD) process is the QBD process whose background process is a homogeneous birth-and-death process, which is a synonym of a skip free random walk in the two dimensional positive quadrant with homogeneous reflecting transitions at each boundary face. It is also a special case of a 0-partially homogenous chain introduced by Borovkov and Mogul’skii [5]. Our main inte...

متن کامل

Geometric decay in level-expanding QBD models

Level-expanding quasi-birth-and-death (QBD) processes have been shown to be an efficient modeling tool for studying multi-dimensional systems, especially twodimensional ones. Computationally, it changes the more challenging problem of dealing with algorithms for two-dimensional systems to a less challenging one for block-structured transition matrices of QBD type with a varying finite block siz...

متن کامل

Diagonal Matrix Reduction over Refinement Rings

  Abstract: A ring R is called a refinement ring if the monoid of finitely generated projective R- modules is refinement.  Let R be a commutative refinement ring and M, N, be two finitely generated projective R-nodules, then M~N  if and only if Mm ~Nm for all maximal ideal m of  R. A rectangular matrix A over R admits diagonal reduction if there exit invertible matrices p and Q such that PAQ is...

متن کامل

Join the shortest queue among $$k$$ parallel queues: tail asymptotics of its stationary distribution

We are concerned with an M/M -type join the shortest queue (M/M -JSQ for short) with k parallel queues for an arbitrary positive integer k, where the servers may be heterogeneous. We are interested in the tail asymptotic of the stationary distribution of this queueing model, provided the system is stable. We prove that this asymptotic for the minimum queue length is exactly geometric, and its d...

متن کامل

Diagonal and Monomial Solutions of the Matrix Equation AXB=C

In this article, we consider the matrix equation $AXB=C$, where A, B, C are given matrices and give new necessary and sufficient conditions for the existence of the diagonal solutions and monomial solutions to this equation. We also present a general form of such solutions. Moreover, we consider the least squares problem $min_X |C-AXB |_F$ where $X$ is a diagonal or monomial matrix. The explici...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012